Combining Kernel Machines Through Decorrelation
نویسنده
چکیده
Motivation: Combinations of classifiers have been found useful empirically, yet no formal proof exists about their generalization ability. Our goal is to develop a combination of kernel machines for which it is possible to prove generalization bounds. We believe that this is possible by further elaborating the arguments presented in [6], which may provide insights on boosting methods and view-based classifiers.
منابع مشابه
Estimation of Combining Ability and Gene Action for Agro-Morphological Characters of Rapeseed (Brassica Napus L.) Using Line×Tester Mating Design
Combining ability effects were estimated for different agronomic characters in line × tester crossing program comprising 21 hybrids produced by crossing 7 lines and 3 testers. Parents and hybrids differed significantly for general combining ability (GCA) and specific combining ability (SCA) effects, respectively. The variance due to GCA and SCA showed that gene action was predominantly additive...
متن کاملEstimation of Combining Ability and Gene Action for Agro-Morphological Characters of Rapeseed (Brassica Napus L.) Using Line×Tester Mating Design
Combining ability effects were estimated for different agronomic characters in line × tester crossing program comprising 21 hybrids produced by crossing 7 lines and 3 testers. Parents and hybrids differed significantly for general combining ability (GCA) and specific combining ability (SCA) effects, respectively. The variance due to GCA and SCA showed that gene action was predominantly additive...
متن کاملBetter Gradient Noise
We present three improvements to Perlin’s gradient noise algorithm. First, a small change in the permutation hash function combined with separate pseudorandom tables yields significantly better axial decorrelation. Second, a modification to the reconstruction kernel approximating a global higher-order differencing operator produces better bandlimitation. Third, the quality of 2D surfaces using ...
متن کاملUndercomplete Blind Subspace Deconvolution
Here, we introduce the blind subspace deconvolution (BSSD) problem, which is the extension of both the blind source deconvolution (BSD) and the independent subspace analysis (ISA) tasks. We treat the undercomplete BSSD (uBSSD) case. Applying temporal concatenation we reduce this problem to ISA. The associated ‘high dimensional’ ISA problem can be handled by a recent technique called joint f-dec...
متن کاملKernel Combination Versus Classifier Combination
Combining classifiers is to join the strengths of different classifiers to improve the classification performance. Using rules to combine the outputs of different classifiers is the basic structure of classifier combination. Fusing models from different kernel machine classifiers is another strategy for combining models called kernel combination. Although classifier combination and kernel combi...
متن کامل